A Self-Dual Polar Factorization for Vector Fields

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Self-dual Polar Factorization for Vector Fields

We show that any non-degenerate vector field u in L∞(Ω,RN), where Ω is a bounded domain in RN , can be written as u(x) = ∇1H(S(x),x) for a.e. x ∈Ω, where S is a measure preserving point transformation on Ω such that S2 = I a.e (an involution), and H : RN ×RN → R is a globally Lipschitz anti-symmetric convex-concave Hamiltonian. Moreover, u is a monotone map if and only if S can be taken to be t...

متن کامل

Self-dual, not self-polar

The smallest number of points of an incidence structure which is self-dual but not self-polar is 7. For non-binary structures (where a “point” may occur more than once in a “block”) the number is 6.

متن کامل

Self-dual two-forms and divergence-free vector fields

Beginning with the self-dual two-forms approach to the Einstein equations, we show how, by choosing basis spinors which are proportional to solutions of the Dirac equation, we may rewrite the vacuum Einstein equations in terms of a set of divergence-free vector fields, which obey a particular set of chiral equations. Upon imposing the Jacobi identity upon these vector fields, we reproduce a pre...

متن کامل

Self-Similar Vector Fields

We propose statistically self-similar and rotation-invariant models for vector fields, study some of the more significant properties of these models, and suggest algorithms and methods for reconstructing vector fields from numerical observations, using the same notions of self-similarity and invariance that give rise to our stochastic models. We illustrate the efficacy of the proposed schemes b...

متن کامل

A dual algorithm for L1-regularized reconstruction of vector fields

Recent advances in vector-field imaging have brought to the forefront the need for efficient denoising and reconstruction algorithms that take the physical properties of vector fields into account and can be applied to large volumes of data. With these requirements in mind, we propose a computationally efficient algorithm for variational denoising and reconstruction of vector fields. Our variat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Communications on Pure and Applied Mathematics

سال: 2012

ISSN: 0010-3640

DOI: 10.1002/cpa.21430